Serving deep learning models with deduplication from relational databases
نویسندگان
چکیده
Serving deep learning models from relational databases brings significant benefits. First, features extracted do not need to be transferred any decoupled systems for inferences, and thus the system management overhead can significantly reduced. Second, in a database, data along storage hierarchy is fully integrated with query processing, it continue model serving even if working set size exceeds available memory. Applying deduplication greatly reduce space, memory footprint, cache misses, inference latency. However, existing techniques are applicable applications databases. They consider impacts on accuracy as well inconsistency between tensor blocks database pages. This work proposed synergistic optimization duplication detection, page packing, caching, enhance serving. Evaluation results show that our improved efficiency latency, outperformed frameworks targeting scenarios.
منابع مشابه
Serving deep learning models in a serverless platform
Serverless computing has emerged as a compelling paradigm for the development and deployment of a wide range of event based cloud applications. At the same time, cloud providers and enterprise companies are heavily adopting machine learning and Artificial Intelligence to either differentiate themselves, or provide their customers with value added services. In this work we evaluate the suitabili...
متن کاملLearning from Skewed Class Multi-relational Databases
Relational databases, with vast amounts of data–from financial transactions, marketing surveys, medical records, to health informatics observations– and complex schemas, are ubiquitous in our society. Multirelational classification algorithms have been proposed to learn from such relational repositories, where multiple interconnected tables (relations) are involved. These methods search for rel...
متن کاملOWLRel: Learning Rich Ontologies from Relational Databases
Mapping between ontologies and relational databases is a necessity in realising the Semantic Web vision. Most of the work concerning this topic has either (1) extracted OWL schemas using a limited range of OWL modelling constructs from relational schemas, or (2) extracted relational schemas from OWL schemas, that represent the OWL schemas as much as possible. By contrast, we propose a general f...
متن کاملLearning to Integrate Relational Databases with Wikipedia
Wikipedia is a general encyclopedia of unprecedented breadth and popularity. However, much of the Web’s factual information still lies within relational databases, each focused on a specific topic. While many database entities are described by corresponding Wikipedia pages, in general this correspondence is unknown unless it has been manually specified. As a result, Web databases cannot leverag...
متن کاملSimilarity-based Deduplication for Databases
dDedup is a similarity-based deduplication scheme for on-line database management systems (DBMSs). Beyond block-level compression of individual database pages or operation log (oplog) messages, as used in today’s DBMSs, dDedup uses byte-level delta encoding of individual records within the database to achieve greater savings. dDedup’s single-pass encoding method can be integrated into the stora...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the VLDB Endowment
سال: 2022
ISSN: ['2150-8097']
DOI: https://doi.org/10.14778/3547305.3547325